Spanning trails
نویسندگان
چکیده
A graph is called 2K2-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every 3 2 -tough 2K2-free graph with at least three vertices has a spanning trail with maximum degree at most 4. In this paper, we confirm this conjecture. We also provide examples for all t < 54 of t-tough graphs that do not have a spanning trail with maximum degree at most 4.
منابع مشابه
Spanning trails in essentially 4-edge-connected graphs
A connected graphG is essentially 4-edge-connected if for any edge cut X ofGwith |X | < 4, either G − X is connected or at most one component of G − X has edges. In this paper, we introduce a reductionmethod and investigate the existence of spanning trails in essentially 4-edge-connected graphs. As an application, we prove that if G is 4-edge-connected, then for any edge subset X0 ⊆ E(G) with |...
متن کاملSpanning 2-trails from degree sum conditions
Suppose G is a simple connected n-vertex graph. Let σ3(G) denote the minimum degree sum of three independent vertices in G (which is ∞ ifG has no set of three independent vertices). A 2-trail is a trail that uses every vertex at most twice. Spanning 2-trails generalize hamilton paths and cycles. We prove three main results. First, if σ3(G) ≥ n−1, then G has a spanning 2-trail, unless G ∼= K1,3....
متن کاملGraphs without spanning closed trails
Jaeger [J. Graph Theory 3 (1979) 91-93] proved that if a graph has two edge-disjoint spanning trees, then it is supereulerian, i.e., that it has a spanning closed trail. Catlin [J. Graph Theory 12 (1988) 29-45] showed that if G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian. Catlin conjectured that if a connected graph G is at most two ...
متن کاملk-Trails: Recognition, Complexity, and Approximations
The notion of degree-constrained spanning hierarchies, also called k-trails, was recently introduced in the context of network routing problems. They describe graphs that are homomorphic images of connected graphs of degree at most k. First results highlight several interesting advantages of k-trails compared to previous routing approaches. However, so far, only little is known regarding comput...
متن کاملMultiple criteria minimum spanning trees
The NP multiple criteria minimum spanning tree as several applications into the network design problems. In this paper, we first introduce some properties than can help to characterize the problem, as well as to produce heuristics to solve it in a more efficient way. In the second part, we propose an application of the Multiple Objective Network optimization based on the Ant Colony Optimization...
متن کامل